Minimal sets on continua with a dense free interval
نویسندگان
چکیده
We study minimal sets on continua X with a dense free interval J and locally connected remainder. This class of includes important spaces such as the topologist's sine curve or Warsaw circle. In case when remainder are known is connected, we obtain full characterization topological structure sets. particular, given in X∖J local dendrite.
منابع مشابه
INTERVAL-VALUED FUZZY m-SEMIOPEN SETS AND INTERVAL-VALUED FUZZY m-PREOPEN SETS ON INTERVAL-VALUED FUZZY MINIMAL SPACES
We introduce the concepts of IVF m-semiopen sets, IVF m-preopen sets, IVF m-semicontinuous mappings and IVF mprecontinuous mappings on interval-valued fuzzy minimal spaces. We investigate characterizations of IVF m-semicontinuous mappings and IVF m-precontinuous mappings and study properties of IVF m-semiopen sets and IVF m-preopen sets.
متن کاملcounterexamples in a−minimal sets
several tables have been given due to a − minimal sets. our main aim in this paper is tocomplete these tables by employing several examples.
متن کاملMinimal k-Free Representations of Frequent Sets
Due to the potentially immense amount of frequent sets that can be generated from transactional databases, recent studies have demonstrated the need for concise representations of all frequent sets. These studies resulted in several successful algorithms that only generate a lossless subset of the frequent sets. In this paper, we present a unifying framework encapsulating most known concise rep...
متن کاملExpansions of o-minimal structures by dense independent sets
Let M be an o-minimal expansion of a densely ordered group and H be a pairwise disjoint collection of dense subsets of M such that ⋃ H is definably independent in M. We study the structure (M, (H)H∈H). Positive results include that every open set definable in (M, (H)H∈H) is definable in M, the structure induced in (M, (H)H∈H) on any H0 ∈ H is as simple as possible (in a sense that is made preci...
متن کاملMinimal dominating sets in interval graphs and trees
We show that interval graphs on n vertices have at most 3 ≈ 1.4422 minimal dominating sets, and that these can be enumerated in time O∗(3n/3). As there are examples of interval graphs that actually have 3 minimal dominating sets, our bound is tight. We show that the same upper bound holds also for trees, i.e. trees on n vertices have at most 3 ≈ 1.4422 minimal dominating sets. The previous best...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2023
ISSN: ['0022-247X', '1096-0813']
DOI: https://doi.org/10.1016/j.jmaa.2022.126607